Proving soundness of combinatorial Vickrey auctions and generating verified executable code
نویسندگان
چکیده
Using mechanised reasoning we prove that combinatorial Vickrey auctions are soundly specified in that they associate a unique outcome (allocation and transfers) to any valid input (bids). Having done so, we auto-generate verified executable code from the formally defined auction. This removes a source of error in implementing the auction design. We intend to use formal methods to verify new auction designs. Here, our contribution is to introduce and demonstrate the use of formal methods for auction verification in the familiar setting of a well-known auction.
منابع مشابه
Insider Threats and Auctions: Formalization, Mechanized Proof, and Code Generation
This paper applies machine assisted formal methods to explore insider threats for auctions. Auction systems, like eBay, are an important problem domain for formal analysis because they challenge modelling concepts as well as analysis methods. We use machine assisted formal modelling and proof in Isabelle to demonstrate how security and privacy goals of auction protocols can be formally verified...
متن کاملThe Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions
This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...
متن کاملVickrey-Clarke-Groves (VCG) Auctions
A VCG auction (named after their inventors Vickrey, Clarke, and Groves) is a generalization of the single-good, second price Vickrey auction to the case of a combinatorial auction (multiple goods, from which any participant can bid on each possible combination). We formalize in this entry VCG auctions, including tie-breaking and prove that the functions for the allocation and the price determin...
متن کاملOnline Combinatorial Auctions
This paper explores the feasibility and motivation for online combinatorial auctions. It explains combinatorial auctions and shows an innovative implementation of an iterative combinatorial auction. It then introduces online auctions and highlights some research which bounds the efficiency and revenue comparison to the standard Vickrey auction. Finally, motivations for online combinatorial auct...
متن کاملLecture 10 4 Combinatorial Auctions 4.1 Vickrey Auction
In this section, we present a few examples from the area of mechanism design. The fundamental questions that one attempts to address in mechanism design is the following: Assuming that players act strategically, how should we design the rules of the game such that the players’ strategic behavior leads to a certain desirable outcome of the game? As a motivating example, we first consider one of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1308.1779 شماره
صفحات -
تاریخ انتشار 2013